0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n021.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Aug  9 03:02:35 EDT 2022
0.14/0.35	% CPUTime    : 
0.21/0.49	Running higher-order on 8 cores theorem proving
0.21/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.21/0.49	# Version: 3.0pre003-ho
0.21/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.21/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.21/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.21/0.50	# Starting almost_fo_3_lam with 120s (1) cores
0.21/0.50	# Starting post_as_ho1 with 120s (1) cores
0.21/0.50	# ehoh_best2_full_lfho with pid 20927 completed with status 0
0.21/0.50	# Result found by ehoh_best2_full_lfho
0.21/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.21/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.21/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.21/0.50	# No SInE strategy applied
0.21/0.50	# Search class: HHHNF-FFSF21-SHSSMFNN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.21/0.50	# Starting new_ho_10 with 65s (1) cores
0.21/0.50	# new_ho_10 with pid 20930 completed with status 0
0.21/0.50	# Result found by new_ho_10
0.21/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.21/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.21/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.21/0.50	# No SInE strategy applied
0.21/0.50	# Search class: HHHNF-FFSF21-SHSSMFNN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.21/0.50	# Starting new_ho_10 with 65s (1) cores
0.21/0.50	# Preprocessing time       : 0.001 s
0.21/0.50	# Presaturation interreduction done
0.21/0.50	
0.21/0.50	# Proof found!
0.21/0.50	# SZS status Theorem
0.21/0.50	# SZS output start CNFRefutation
0.21/0.50	thf(decl_22, type, meq_ind: mu > mu > $i > $o).
0.21/0.50	thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.21/0.50	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.21/0.50	thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.21/0.50	thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.21/0.50	thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
0.21/0.50	thf(decl_35, type, mtrue: $i > $o).
0.21/0.50	thf(decl_36, type, mfalse: $i > $o).
0.21/0.50	thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.21/0.50	thf(decl_39, type, mreflexive: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_40, type, msymmetric: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_41, type, mserial: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_42, type, mtransitive: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_43, type, meuclidean: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_45, type, mfunctional: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o).
0.21/0.50	thf(decl_49, type, mvalid: ($i > $o) > $o).
0.21/0.50	thf(decl_50, type, minvalid: ($i > $o) > $o).
0.21/0.50	thf(decl_51, type, msatisfiable: ($i > $o) > $o).
0.21/0.50	thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o).
0.21/0.50	thf(decl_53, type, rel_s4: $i > $i > $o).
0.21/0.50	thf(decl_54, type, mbox_s4: ($i > $o) > $i > $o).
0.21/0.50	thf(decl_55, type, mdia_s4: ($i > $o) > $i > $o).
0.21/0.50	thf(decl_56, type, p: $i > $o).
0.21/0.50	thf(decl_57, type, esk1_0: $i).
0.21/0.50	thf(decl_58, type, esk2_1: $i > $i).
0.21/0.50	thf(decl_59, type, esk3_2: $i > $i > $i).
0.21/0.50	thf(decl_60, type, esk4_0: $i).
0.21/0.50	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)).
0.21/0.50	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)).
0.21/0.50	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)).
0.21/0.50	thf(mdia_s4, axiom, ((mdia_s4)=(^[X6:$i > $o]:(mnot @ (mbox_s4 @ (mnot @ X6))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mdia_s4)).
0.21/0.50	thf(mbox_s4, axiom, ((mbox_s4)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_s4 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mbox_s4)).
0.21/0.50	thf(mtransitive, axiom, ((mtransitive)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X13 @ X15 @ X16)&(X13 @ X16 @ X17))=>(X13 @ X15 @ X17)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mtransitive)).
0.21/0.50	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)).
0.21/0.50	thf(a2, axiom, (mtransitive @ rel_s4), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', a2)).
0.21/0.50	thf(prove, conjecture, (mvalid @ (mimplies @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ (mdia_s4 @ p)))) @ (mbox_s4 @ (mdia_s4 @ p)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)).
0.21/0.50	thf(mreflexive, axiom, ((mreflexive)=(^[X13:$i > $i > $o]:(![X15:$i]:((X13 @ X15 @ X15))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mreflexive)).
0.21/0.50	thf(a1, axiom, (mreflexive @ rel_s4), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', a1)).
0.21/0.50	thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.21/0.50	thf(c_0_12, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.21/0.50	thf(c_0_13, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.21/0.50	thf(c_0_14, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_s4 @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(fof_simplification,[status(thm)],[mdia_s4])).
0.21/0.50	thf(c_0_15, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_s4 @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_s4])).
0.21/0.50	thf(c_0_16, plain, ((mtransitive)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X16 @ X17))=>(Z0 @ X15 @ X17)))))), inference(fof_simplification,[status(thm)],[mtransitive])).
0.21/0.50	thf(c_0_17, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
0.21/0.50	thf(c_0_18, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.21/0.50	thf(c_0_19, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_s4 @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_12]), c_0_15])).
0.21/0.50	thf(c_0_20, plain, ![X22:$i, X23:$i, X24:$i]:((((rel_s4 @ X22 @ X23)&(rel_s4 @ X23 @ X24))=>(rel_s4 @ X22 @ X24))), inference(apply_def,[status(thm)],[a2, c_0_16])).
0.21/0.50	thf(c_0_21, negated_conjecture, ~(![X32:$i]:((~(![X29:$i]:((~(rel_s4 @ X32 @ X29)|~(![X28:$i]:((~(rel_s4 @ X29 @ X28)|~(![X27:$i]:((~(rel_s4 @ X28 @ X27)|~(![X26:$i]:((~(rel_s4 @ X27 @ X26)|~(p @ X26)))))))))))))|![X31:$i]:((~(rel_s4 @ X32 @ X31)|~(![X30:$i]:((~(rel_s4 @ X31 @ X30)|~(p @ X30))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]), c_0_17]), c_0_18]), c_0_15]), c_0_19])])).
0.21/0.50	thf(c_0_22, plain, ![X33:$i, X34:$i, X35:$i]:((~(rel_s4 @ X33 @ X34)|~(rel_s4 @ X34 @ X35)|(rel_s4 @ X33 @ X35))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])).
0.21/0.50	thf(c_0_23, negated_conjecture, ![X38:$i, X40:$i, X43:$i]:(((((rel_s4 @ X38 @ (esk2_1 @ X38))|~(rel_s4 @ esk1_0 @ X38))&(((rel_s4 @ X40 @ (esk3_2 @ X38 @ X40))|~(rel_s4 @ (esk2_1 @ X38) @ X40)|~(rel_s4 @ esk1_0 @ X38))&((p @ (esk3_2 @ X38 @ X40))|~(rel_s4 @ (esk2_1 @ X38) @ X40)|~(rel_s4 @ esk1_0 @ X38))))&((rel_s4 @ esk1_0 @ esk4_0)&(~(rel_s4 @ esk4_0 @ X43)|~(p @ X43))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])])).
0.21/0.50	thf(c_0_24, plain, ((mreflexive)=(^[Z0:$i > $i > $o]:(![X15:$i]:((Z0 @ X15 @ X15))))), inference(fof_simplification,[status(thm)],[mreflexive])).
0.21/0.50	thf(c_0_25, plain, ![X14:$i, X3:$i, X15:$i]:(((rel_s4 @ X3 @ X15)|~((rel_s4 @ X3 @ X14))|~((rel_s4 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_22])).
0.21/0.50	thf(c_0_26, negated_conjecture, ![X3:$i, X14:$i]:(((rel_s4 @ X3 @ (esk3_2 @ X14 @ X3))|~((rel_s4 @ (esk2_1 @ X14) @ X3))|~((rel_s4 @ esk1_0 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.50	thf(c_0_27, plain, ![X25:$i]:((rel_s4 @ X25 @ X25)), inference(apply_def,[status(thm)],[a1, c_0_24])).
0.21/0.50	thf(c_0_28, negated_conjecture, ![X3:$i]:((~((rel_s4 @ esk4_0 @ X3))|~((p @ X3)))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.50	thf(c_0_29, negated_conjecture, ![X14:$i, X3:$i, X15:$i]:(((rel_s4 @ X3 @ (esk3_2 @ X14 @ X15))|~((rel_s4 @ (esk2_1 @ X14) @ X15))|~((rel_s4 @ esk1_0 @ X14))|~((rel_s4 @ X3 @ X15)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.21/0.50	thf(c_0_30, negated_conjecture, ![X14:$i, X3:$i]:(((p @ (esk3_2 @ X3 @ X14))|~((rel_s4 @ (esk2_1 @ X3) @ X14))|~((rel_s4 @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.50	thf(c_0_31, plain, ![X36:$i]:((rel_s4 @ X36 @ X36)), inference(variable_rename,[status(thm)],[c_0_27])).
0.21/0.50	thf(c_0_32, negated_conjecture, ![X3:$i, X14:$i]:((~((rel_s4 @ (esk2_1 @ X3) @ X14))|~((rel_s4 @ esk1_0 @ X3))|~((rel_s4 @ esk4_0 @ X14)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
0.21/0.50	thf(c_0_33, plain, ![X3:$i]:((rel_s4 @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_31])).
0.21/0.50	thf(c_0_34, negated_conjecture, ![X3:$i]:((~((rel_s4 @ esk4_0 @ (esk2_1 @ X3)))|~((rel_s4 @ esk1_0 @ X3)))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.21/0.50	thf(c_0_35, negated_conjecture, ![X3:$i]:(((rel_s4 @ X3 @ (esk2_1 @ X3))|~((rel_s4 @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.50	thf(c_0_36, negated_conjecture, (rel_s4 @ esk1_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.50	thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), ['proof']).
0.21/0.50	# SZS output end CNFRefutation
0.21/0.50	# Parsed axioms                        : 72
0.21/0.50	# Removed by relevancy pruning/SinE    : 0
0.21/0.50	# Initial clauses                      : 43
0.21/0.50	# Removed in clause preprocessing      : 36
0.21/0.50	# Initial clauses in saturation        : 7
0.21/0.50	# Processed clauses                    : 30
0.21/0.50	# ...of these trivial                  : 0
0.21/0.50	# ...subsumed                          : 3
0.21/0.50	# ...remaining for further processing  : 27
0.21/0.50	# Other redundant clauses eliminated   : 0
0.21/0.50	# Clauses deleted for lack of memory   : 0
0.21/0.50	# Backward-subsumed                    : 0
0.21/0.50	# Backward-rewritten                   : 0
0.21/0.50	# Generated clauses                    : 37
0.21/0.50	# ...of the previous two non-redundant : 34
0.21/0.50	# ...aggressively subsumed             : 0
0.21/0.50	# Contextual simplify-reflections      : 2
0.21/0.50	# Paramodulations                      : 37
0.21/0.50	# Factorizations                       : 0
0.21/0.50	# NegExts                              : 0
0.21/0.50	# Equation resolutions                 : 0
0.21/0.50	# Propositional unsat checks           : 0
0.21/0.50	#    Propositional check models        : 0
0.21/0.50	#    Propositional check unsatisfiable : 0
0.21/0.50	#    Propositional clauses             : 0
0.21/0.50	#    Propositional clauses after purity: 0
0.21/0.50	#    Propositional unsat core size     : 0
0.21/0.50	#    Propositional preprocessing time  : 0.000
0.21/0.50	#    Propositional encoding time       : 0.000
0.21/0.50	#    Propositional solver time         : 0.000
0.21/0.50	#    Success case prop preproc time    : 0.000
0.21/0.50	#    Success case prop encoding time   : 0.000
0.21/0.50	#    Success case prop solver time     : 0.000
0.21/0.50	# Current number of processed clauses  : 20
0.21/0.50	#    Positive orientable unit clauses  : 2
0.21/0.50	#    Positive unorientable unit clauses: 0
0.21/0.50	#    Negative unit clauses             : 2
0.21/0.50	#    Non-unit-clauses                  : 16
0.21/0.50	# Current number of unprocessed clauses: 18
0.21/0.50	# ...number of literals in the above   : 83
0.21/0.50	# Current number of archived formulas  : 0
0.21/0.50	# Current number of archived clauses   : 7
0.21/0.50	# Clause-clause subsumption calls (NU) : 90
0.21/0.50	# Rec. Clause-clause subsumption calls : 62
0.21/0.50	# Non-unit clause-clause subsumptions  : 4
0.21/0.50	# Unit Clause-clause subsumption calls : 1
0.21/0.50	# Rewrite failures with RHS unbound    : 0
0.21/0.50	# BW rewrite match attempts            : 2
0.21/0.50	# BW rewrite match successes           : 0
0.21/0.50	# Condensation attempts                : 30
0.21/0.50	# Condensation successes               : 0
0.21/0.50	# Termbank termtop insertions          : 3320
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.006 s
0.21/0.50	# System time              : 0.003 s
0.21/0.50	# Total time               : 0.009 s
0.21/0.50	# Maximum resident set size: 1888 pages
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.007 s
0.21/0.50	# System time              : 0.006 s
0.21/0.50	# Total time               : 0.014 s
0.21/0.50	# Maximum resident set size: 1800 pages
0.21/0.50	EOF